Classifying Arc-Transitive Circulants of Square-Free Order
نویسندگان
چکیده
A circulant is a Cayley graph of a cyclic group Arc transitive circulants of square free order are classi ed It is shown that an arc transitive circulant of square free order n is one of the following the lexicographic product Kb or the deleted lexicographic Kb b where n bm and is an arc transitive circulant or is a normal circulant that is Aut has a normal regular cyclic subgroup
منابع مشابه
Classifying Arc-Transitive Circulants
A circulant is a Cayley digraph over a finite cyclic group. The classification of arc-transitive circulants is shown. The result follows from earlier descriptions of Schur rings over cyclic groups.
متن کاملA Classification of 2-Arc-Transitive Circulants
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of it-arcs of X. A circulant is a Cayley graph of a cyclic group. A classification of 2-arc-transitive circulants is given.
متن کاملPermutation Groups with a Cyclic Regular Subgroup and Arc Transitive Circulants
A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970’s. It is shown that a connected arc transitive circulant of order n is one of the following: a complete graph Kn , a lexicographic product [K̄b], a deleted lexicographic product [K̄b] − b , where ...
متن کاملClassifying 2-arc-transitive graphs of order a product of two primes
A classi cation of all arc transitive graphs of order a product of two primes is given Furthermore it is shown that cycles and complete graphs are the only arc transitive Cayley graph of abelian group of odd order Introductory remarks Throughout this paper graphs are nite simple and undirected By p and q we shall always denote prime numbers A k arc in a graph X is a sequence of k vertices v v v...
متن کاملOn Edge-Transitive Graphs of Square-Free Order
We study the class of edge-transitive graphs of square-free order and valency at most k. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.
متن کامل